n,k = input().split()
k = int(k)
length = len(n)-1
count = 0
while length >= 0 and k:
if n[length] == "0":
k -= 1
else:
count += 1
length -= 1
if k:
print(len(n)-1)
else:
print(count)
//Je Cruis En Moi
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e3 + 10;
pair <int, int> t[MAXN];
int main () {
int k, ans = 0, x = 0, m = 0;
string n;
cin >> n >> k;
for (int i = 0; i <= (int)n.size() - 1; i ++) {
if (n[i] == '0')
m ++;
}
if (m < k) {
if (m == 0)
cout << 0 << endl;
else
cout << (int)n.size() - 1 << endl;
return 0;
}
for (int i = (int)n.size() - 1; i >= 0; i --) {
if (n[i] == '0')
x ++;
//cout << i << " " <<x << endl;
if (x == k) {
cout << (((int)n.size() - i) - x);
return 0;
}
}
return 0;
}
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |
706A - Beru-taxi | 686A - Free Ice Cream |
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |